package queue;

public class SeqQueue<T> implements Queue<T> {
    private Object element[];
    // 队头元素下标
    private int front;
    // 队尾后面一个下标，即下一个入队元素的下标
    private int rear;

    public SeqQueue() {
        this(64);
    }

    public SeqQueue(int length) {
        this.element = new Object[length];
        this.front = this.rear = 0;
    }



    public String toString() {
        return "to be done";
    }

    @Override
    public boolean isEmpty() {
        return false;
    }

    @Override
    public boolean add(T x) {
        return false;
    }

    @Override
    public T peek() {
        return null;
    }

    @Override
    public T poll() {
        return null;
    }


    public static void main(String args[])
    {
        SeqQueue<Integer> que = new SeqQueue<Integer>();
        que.add(new Integer(10));
        que.add(new Integer(20));
        System.out.println("poll : "+que.poll().toString()+"  "+que.poll().toString()+"  ");
        System.out.println(que.toString());
        que.add(new Integer(30));
        que.add(new Integer(40));
        que.add(new Integer(50));
        que.add(new Integer(60));
        System.out.println(que.toString());
        que.add(new Integer(70));
        System.out.println(que.toString());
    }

}
